Span-Program-Based Quantum Algorithms for Graph Bipartiteness and Connectivity
نویسنده
چکیده
Span program is a linear-algebraic model of computation which can be used to design quantum algorithms. For any Boolean function there exists a span program that leads to a quantum algorithm with optimal quantum query complexity. In general, finding such span programs is not an easy task. In this work, given a query access to the adjacency matrix of a simple graph G with n vertices, we provide two new span-program-based quantum algorithms: – an algorithm for testing if the graph is bipartite that uses O(n √ n) quantum queries; – an algorithm for testing if the graph is connected that uses O(n √
منابع مشابه
Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection
We introduce a span program that decides st-connectivity, and generalize the span program to develop quantum algorithms for several graph problems. First, we give an algorithm for st-connectivity that uses O(n √ d) quantum queries to the n× n adjacency matrix to decide if vertices s and t are connected, under the promise that they either are connected by a path of length at most d, or are disco...
متن کاملTime and space efficient quantum algorithms for detecting cycles and testing bipartiteness
We study space and time efficient quantum algorithms for two graph problems – deciding whether an n-vertex graph is a forest, and whether it is bipartite. Via a reduction to the s-t connectivity problem, we describe quantum algorithms for deciding both properties in Õ(n) time and using O(log n) classical and quantum bits of storage in the adjacency matrix model. We then present quantum algorith...
متن کاملImproved Sampling with Applications to Dynamic Graph Algorithms
We state a new sampling lemma and use it to improve the running time of dynamic graph algorithms. For the dynamic connectivity problem the previously best randomized algorithm takes expected time O(log 3 n) per update, amortized over (m) updates. Using the new sampling lemma, we improve its running time to O(log 2 n). There exists a lower bound in the cell probe model for the time per operation...
متن کاملA Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملTowards a measure of vulnerability, tenacity of a Graph
If we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number and tenacity.In this paper we discuss...
متن کامل